-
1 n-tuple root
Большой англо-русский и русско-английский словарь > n-tuple root
-
2 n-tuple root
Математика: n-кратный корень -
3 n-tuple root
мат. -
4 root
1) основание2) корень || укореняться3) мат. корень || извлекать корень5) корешок || корешковый6) корневая часть || корневой7) pl корнеплоды8) гидр. сопряжение плотины с береговым откосом9) геол. ядро геоантиклинали10) горн. нижняя граница рудного тела11) геол. крутая часть надвига•- strongly orthogonal rootsto extract [to take] the root of a number — извлекать корень из числа
-
5 n-кратный корень
Большой англо-русский и русско-английский словарь > n-кратный корень
-
6 sum
1) сумма; итог || суммировать, складывать; подводить итог3) резюмировать•sum over sum — мат. сумма вдоль подпространства
sum taken over — сумма, взятая по…
to sum up — резюмировать, суммировать
to sum with respect to — суммировать по...
- free sum- rank sum- regression sum of squares- risk sum- row sum- sum of squares for contrasts- unit sum
См. также в других словарях:
-tuple — a suffix added to a number by mathematicians to create units of quantity; a 7 tuple, for example, contains 7 objects, listed in a specified order. The suffix has the same Latin root as ply, meaning fold … Dictionary of units of measurement
Exponentiation — Exponent redirects here. For other uses, see Exponent (disambiguation). Exponentiation is a mathematical operation, written as an, involving two numbers, the base a and the exponent (or power) n. When n is a positive integer, exponentiation… … Wikipedia
Eiffel (programming language) — Infobox programming language name = Eiffel paradigm = object oriented year = 1986 designer = Bertrand Meyer developer = Bertrand Meyer Eiffel Software latest release version = 4.2 latest release date = Feb 6, 1998 typing = static typing, strong… … Wikipedia
Discrete Fourier transform (general) — See also: Fourier transform on finite groups This article is about the discrete Fourier transform (DFT) over any field (including finite fields), commonly called a number theoretic transform (NTT) in the case of finite fields. For specific… … Wikipedia
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Rete algorithm — The Rete algorithm is an efficient pattern matching algorithm for implementing production rule systems. The Rete algorithm was designed by Dr Charles L. Forgy of Carnegie Mellon University, first published in a working paper in 1974, and later… … Wikipedia
probability theory — Math., Statistics. the theory of analyzing and making statements concerning the probability of the occurrence of uncertain events. Cf. probability (def. 4). [1830 40] * * * Branch of mathematics that deals with analysis of random events.… … Universalium
Ducci sequence — A Ducci sequence is a sequence of n tuples of integers. Given an n tuple of integers (a1,a2,...,an), the next n tuple in the sequence is formed by taking the absolute differences of neighbouring integers: Another way of describing this is as… … Wikipedia
Mean — This article is about the statistical concept. For other uses, see Mean (disambiguation). In statistics, mean has two related meanings: the arithmetic mean (and is distinguished from the geometric mean or harmonic mean). the expected value of a… … Wikipedia
Circle of fifths — showing major and minor keys … Wikipedia
cryptology — cryptologist, n. cryptologic /krip tl oj ik/, cryptological, adj. /krip tol euh jee/, n. 1. cryptography. 2. the science and study of cryptanalysis and cryptography. [1635 45; < NL cryptologia. See CRYPTO , LOGY] * * * Introduction … Universalium